skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Avdonina, Nina"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Journal of Physics A: Mathematical and Theoretical)
    Abstract In this paper, we explore the inverse dynamic problem for the Dirac system on finite metric graphs, including trees and graphs with a cycle. Our primary objective is to reconstruct the graph’s topology (connectivity), determine the lengths of its edges, and identify the matrix potential function on each edge. By using only the dynamic matrix response operator as our inverse data, we adapt the leaf peeling method to recover the unknown data on a tree graph. We then introduce a new approach to reconstruct the unknown data on a graph with a cycle. Additionally, we present a novel dynamic algorithm to address the forward problem for the Dirac system on finite metric graphs. 
    more » « less
    Free, publicly-accessible full text available January 31, 2026